Expected value expansions in rooted graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Expected Value Expansions in Rooted Graphs

When G is a rooted graph where each edge may independently succeed with probability p, we consider the expected number of vertices in the operational component of G containing the root. This expected value EV (G;p) is a polynomial in p. We present several distinct equivalent formulations of EV (G;p), unifying prior treatments of this topic. We use results on network resilience (introduced by Co...

متن کامل

Expected rank and randomness in rooted graphs

For a rooted graph G, let EVb(G; p) be the expected number of vertices reachable from the root when each edge has an independent probability p of operating successfully. We determine the expected value of EVb(G; p) for random trees, and include a connection to unrooted trees. We also consider rooted digraphs, computing the expected value of a random orientation of a rooted graph G in terms of E...

متن کامل

Generating Internally Triconnected Rooted Graphs

A biconnected plane graph G is called internally triconnected if any cut-pair consists of outer vertices and its removal results in only components each of which contains at least one outer vertex. In a rooted plane graph, an edge is designated as an outer edge with a specified direction. For given positive integers n ≥ 1 and g ≥ 3, let G3(n, g) (resp., Gint(n, g)) denote the class of all trico...

متن کامل

A characteristic polynomial for rooted graphs and rooted digraphs

We consider the one-variable characteristic polynomial p(G; ) in two settings. When G is a rooted digraph, we show that this polynomial essentially counts the number of sinks in G. When G is a rooted graph, we give combinatorial interpretations of several coe/cients and the degree of p(G; ). In particular, |p(G; 0)| is the number of acyclic orientations of G, while the degree of p(G; ) gives th...

متن کامل

Evaluating Cost Efficiency in Fuzzy Environment by Using Expected Value

Today, one of the most fundamental issues within the field of industrial and nonindustrial activities is evaluate the costs performance of the units which are associated with industrial and nonindustrial activities. Data envelopment analysis (DEA) is a nonparametric method for evaluating performance. Fuzzy sets theory is a powerful tool for mentioning ambiguous situations. Traditional DEA model...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2003

ISSN: 0166-218X

DOI: 10.1016/s0166-218x(02)00568-1